A new LBFS-based algorithm for cocomparability graph recognition
نویسندگان
چکیده
منابع مشابه
A Four-Sweep LBFS Recognition Algorithm for Interval Graphs
In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based on six sweeps of Lexicographic Breadth-First Search (LBFS) and prove its correctness. They believe that their corresponding 5-sweep LBFS interval graph recognition algorithm is also correct. Thanks to the LBFS structure theory established mainly by Corneil et al., we are able to present a 4-sweep...
متن کاملA simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
We present a simple linear time algorithm for unit interval graph recognition. This algorithm uses 3 LBFS sweeps and then a very simple test to determine if the given graph is a unit interval graph. It is argued that this algorithm is the most easily implementable unit interval graph recognition algorithm known. ? 2003 Elsevier B.V. All rights reserved.
متن کاملA Fast Matching Algorithm for Graph-Based Handwriting Recognition
The recognition of unconstrained handwriting images is usually based on vectorial representation and statistical classification. Despite their high representational power, graphs are rarely used in this field due to a lack of efficient graph-based recognition methods. Recently, graph similarity features have been proposed to bridge the gap between structural representation and statistical class...
متن کاملa new type-ii fuzzy logic based controller for non-linear dynamical systems with application to 3-psp parallel robot
abstract type-ii fuzzy logic has shown its superiority over traditional fuzzy logic when dealing with uncertainty. type-ii fuzzy logic controllers are however newer and more promising approaches that have been recently applied to various fields due to their significant contribution especially when the noise (as an important instance of uncertainty) emerges. during the design of type- i fuz...
15 صفحه اولA Dynamic Algorithm for Line Graph Recognition
For a graph G = (V; E) its line graph L(G) has the node set E and two nodes of L(G) are adjacent if the corresponding edges of G have a common endpoint. The problem of nding G for a given L was already optimally solved by Lehot7] and Roussopoulos10]. Here we present a new dynamic solution to this problem, where we can add or delete a node v in L(G) in time proportional to the size of its adjace...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.07.016